The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities
نویسندگان
چکیده
منابع مشابه
Undecidability of the Lambek Calculus with Subexponential and Bracket Modalities
Morrill and Valent́ın in the paper “Computational coverage of TLG: Nonlinearity” considered two extensions of the Lambek calculus with socalled “exponential” modalities. These calculi serve as a basis for describing fragments of natural language via categorial grammars. In this paper we show undecidability of derivability problems in these two calculi. On the other hand, restricted fragments of ...
متن کاملA Count Invariant for Lambek Calculus with Additives and Bracket Modalities
The count invariance of van Benthem (1991[16]) is that for a sequent to be a theorem of the Lambek calculus, for each atom, the number of positive occurrences equals the number of negative occurrences. (The same is true for multiplicative linear logic.) The count invariance provides for extensive pruning of the sequent proof search space. In this paper we generalize count invariance to categori...
متن کاملProof Nets for Multiplicative Cyclic Linear Logic and Lambek Calculus
This paper presents a simple and intuitive syntax for proof nets of the multiplicative cyclic fragment (McyLL) of linear logic (LL). The proposed correctness criterion for McyLL proof nets can be considered as the non-commutative counterpart of the famous Danos contraction criterion for proof nets of the pure multiplicative fragment (MLL) of LL. Unlike the most part of current syntaxes for non-...
متن کاملDiscontinuity And The Lambek Calculus
This paper is concerned with tile treatment of discontinuous constituency within Categorial Grammar. In particular, I address the problem of providing an adequate formalisation of categorial commctives l)rol)osed by Moortgat (1988), which are useful for handling certain forms of diseontimmus eonstitnency, l)espite some interesting proposals, a satisfactory logic for these e{mnectives has so far...
متن کاملLambek Calculus with Nonlogical Axioms
We study Nonassociative Lambek Calculus and Associative Lambek Calculus enriched with finitely many nonlogical axioms. We prove that the nonassociative systems are decidable in polynomial time and generate context-free languages. In [Buszkowski 1982] it has been shown that finite axiomatic extensions of Associative Lambek Calculus generate all recursively enumerable languages; here we give a ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic, Language and Information
سال: 2020
ISSN: 0925-8531,1572-9583
DOI: 10.1007/s10849-020-09320-9